Recursive constructions for cyclic BIB designs and their generalizations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of nested directed BIB designs

A directed BIB design DB(k, A; v) is a BIB design B(k, 2A; v) in which the blocks are transitively ordered k-tuples and each ordered pair of elements occurs in exactly A blocks. A nested directed BIB design NDB(k, A; v) of form IT2<n<k-l(njn, An)in is a DB(k, A; v) where each block contains E2<n<k-l injn mutually disjoint subblocks, injn subblocks of which are partitIoned into in mutually disjo...

متن کامل

Product constructions for cyclic block designs II. Steiner 2-designs

In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...

متن کامل

Stochastically Recursive Sequences and Their Generalizations

The paper deals with the stochastically recursive sequences { X (n) } defined as the solutions of equations X (n + 1) = f (X (n) , ξ n) (where ξ n is a given random sequence), and with random sequences of a more general nature, named recursive chains. For those the theorems of existence, ergodicity, stability are established, the stationary majorants are constructed. Continuous-time processes a...

متن کامل

Recursive constructions and their maximum likelihood decoding

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

متن کامل

Uniform Designs and Their Combinatorial Constructions

Uniform designs has been widely used in various fields. In this talk, two constructions for uniform designs from combinatorics are presented. One is obtained by resolvable PPBDs which serves to unify some known combinatorial constructions. The other provides a recursive method to obtain a new three-level uniform design from old one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1993

ISSN: 0012-365X

DOI: 10.1016/0012-365x(93)90395-a